Non-Speculative and Upward Invocation of Continuations in a Parallel Language
نویسنده
چکیده
A method of preserving the sequential semantics in parallel pro grams with rst class continuations is to invoke continuations non speculati vely This method which prevents a continuation from being invoked as long as its invocation can infringe the sequential semantics reduces parallelism by the severe conditions that it imposes especially on upward uses In this paper we present new conditions for invoking continuations in an upward way and both preserving the sequential semantics and providing parallelism This new approach is formalised in the PCKS machine which is proved to be correct by showing that it has the same observational equivalence theory as the sequential semantics
منابع مشابه
Non - speculative and Upward Invocation ofContinuations in a Parallel
A method of preserving the sequential semantics in parallel programs with rst-class continuations is to invoke continuations non-speculatively. This method, which prevents a continuation from being invoked as long as its invocation can infringe the sequential semantics, reduces parallelism by the severe conditions that it imposes, especially on upward uses. In this paper, we present new conditi...
متن کاملenvuedel'obtentiondugrade deDocteurenSciencesAppliquees
The interpreter continuation is the computation that remains to be performed after evaluating a given expression. Some programming languages provide the programmer with two facilities to act on the interpreter continuation: the capture and the invocation. The capture of a continuation consists in packaging up the current interpreter continuation as a rst-class object so that it can be manipulat...
متن کاملUsing a Continuation Twice and Its Implications for the Expressive Power of Call/CC
We study the implications for the expressive power of call/cc of upward continuations , speciically the idiom of using a continuation twice. Although such control eeects were known to Landin and Reynolds when they invented J and escape, the forebears of call/cc, they still act as a conceptual pitfall for some attempts to reason about continuations. We use this idiom to refute some recent conjec...
متن کاملThe Eureka Programming Model for Speculative Task Parallelism
In this paper, we describe the Eureka Programming Model (EuPM) that simplifies the expression of speculative parallel tasks, and is especially well suited for parallel search and optimization applications. The focus of this work is to provide a clean semantics for, and efficiently support, such “eureka-style” computations (EuSCs) in general structured task parallel programming models. In EuSCs,...
متن کاملTowards a new model of speculative bubbles: nonparametric test with an application to the Tunisian Stock Index
Bubbles in asset prices have fascinated researchers in finance. Identify asset bubbles, by circumstances, on the stock market has been a growing number of research theoretical and empirical. On a theoretical level, it was assumed that the price dynamics reflect irrational behavior of economic agents and, therefore, should be excluded from a deal with the truly rational economic agents Burmeiste...
متن کامل